Locally complete sets and finite decomposable codes
نویسندگان
چکیده
منابع مشابه
Eulerian edge sets in locally finite graphs
In a finite graph, an edge set Z is an element of the cycle space if and only if every vertex has even degree in Z. We extend this basic result to the topological cycle space, which allows infinite circuits, of locally finite graphs. In order to do so, it becomes necessary to attribute a parity to the ends of the graph.
متن کاملComplete Axiomatisations of Properties of Finite Sets
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, both taking a finite set as argument. We present a basic Hilbert-style axiomatisation, and study its completeness. The main results are syntactic and semantic characterisations of complete extensions of the logic.
متن کاملSome Generalizations of Locally Closed Sets
Arenas et al. [1] introduced the notion of lambda-closed sets as a generalization of locally closed sets. In this paper, we introduce the notions of lambda-locally closed sets, Lambda_lambda-closed sets and lambda_g-closed sets and obtain some decompositions of closed sets and continuity in topological spaces.
متن کاملGroups whose locally maximal product - free sets are complete
Let G be a finite group and S a subset of G. Then S is product-free if S ∩ SS = ∅, and complete if G∗ ⊆ S ∪ SS. A product-free set is locally maximal if it is not contained in a strictly larger product-free set. If S is product-free and complete then S is locally maximal, but the converse does not necessarily hold. Street and Whitehead [11] defined a group G as filled if every locally maximal p...
متن کاملSelf-Dual and Decomposable Geometric Goppa Codes
In this paper, a necessary and sufficient criterion for self-duality of geometric Goppa codes is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00440-0